منابع مشابه
Approximate selection theorems with n-connectedness
*Correspondence: [email protected] Department of Mathematics Education, Sehan University, YoungAm-gun, Chunnam 526-702, Korea Abstract We establish new approximate selection theorems for almost lower semicontinuous multimaps with n-connectedness. Our results unify and extend the approximate selection theorems in many published works and are applied to topological semilattices with path-connec...
متن کاملApproximate $n-$ideal amenability of module extension Banach algebras
Let $mathcal{A}$ be a Banach algebra and $X$ be a Banach $mathcal{A}-$bimodule. We study the notion of approximate $n-$ideal amenability for module extension Banach algebras $mathcal{A}oplus X$. First, we describe the structure of ideals of this kind of algebras and we present the necessary and sufficient conditions for a module extension Banach algebra to be approximately n-ideally amenable.
متن کاملApproximate N-View Stereo
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are increasingly tighter supersets of an unknown, arbitrarily-shaped 3D scene. By studying 3D shapes that reproduce the input photographs up to a special image transformation called a shuffle transformation, we prove that (...
متن کاملOn Connectedness of Graphs
A graph structure is deened on the Weyl groups. We show that these graphs are connected for Weyl groups of type An for n 4. 1. Introduction. We have deened a graph structure on Weyl groups through the root system associated with them. The planarity and the other properties of such graphs has been studied elsewhere (1] and 2]). The motivation for these graphs come from the method employed in pro...
متن کاملOn the probability of connectedness
Given a class of structures with a notion of connectedness (satisfying some reasonable assumptions), we consider the limit (as n -+ oc) of the probability that a random (labelled or unlabelled) n-element structure in the class is connected. The paper consists of three parts: two specific examples, N-free graphs and posets, where the limiting probability of connectedness is one-half and the gold...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1983
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-118-1-69-74